Broken circuit complexes of series–parallel networks
نویسندگان
چکیده
منابع مشابه
Broken Circuit Complexes: Factorizations and Generalizations
Motivated by the question of when the characteristic polynomial of a matroid factorizes, we study join-factorizations of broken circuit complexes and rooted complexes (a more general class of complexes). Such factorizations of complexes induce factorizations not only of the characteristic polynomial but also of the Orlik-Solomon algebra of the matroid. The broken circuit complex of a matroid fa...
متن کاملBroken circuit complexes: Factorizations and generalizations
Motivated by the question of when the characteristic polynomial of a matroid factorizes, we study join-factorizations of broken circuit complexes and rooted complexes (a more general class of complexes). Such factorizations of complexes induce factorizations not only of characteristic polynomial but also of the Orlik-Solomon algebra of the matroid. The broken circuit complex of a matroid factor...
متن کاملMonomial bases for broken circuit complexes
Let F be a field and let G be a finite graph with a total ordering on its edge set. Richard Stanley noted that the Stanley-Reisner ring F (G) of the broken circuit complex of G is CohenMacaulay. Jason Brown gave an explicit description of a homogeneous system of parameters for F (G) in terms of fundamental cocircuits in G. So F (G) modulo this hsop is a finite dimensional vector space. We conje...
متن کاملA Broken Circuit Ring
Given a matroid M represented by a linear subspace L ⊂ C (equivalently by an arrangement of n hyperplanes in L), we define a graded ring R(L) which degenerates to the Stanley-Reisner ring of the broken circuit complex for any choice of ordering of the ground set. In particular, R(L) is Cohen-Macaulay, and may be used to compute the h-vector of the broken circuit complex of M . We give a geometr...
متن کاملBijective proofs of two broken circuit theorems
We prove, by means of explicit bijections, theorems of Whitney and Stanley that express the coefficients of the chromatic polynomial of a graph G and the number of acyclic orientations of G in terms of numbers of sets of edges that contain no broken circuits of G. Let G be a graph, and let a total ordering of its edge set E ( G ) be fixed. Words like “first” or “later,” when applied to edges, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2016
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2015.04.009